منابع مشابه
Deriving Relation Keys from XML Keys
Much work on XML data was around storage and querying and did not consider constraints of XML, especially keys. Since constraints have been proposed in many papers for XML, much research work on constraints has been being done. In this paper, we consider an important class of constraints, XML keys, and try to find the relationship between XML keys and relation keys. Given XML data whose semanti...
متن کاملKeys in XML (
In this article a new type of key constraint in XML, called an XKey, is proposed. The motivation for an XKey is based on the observation that existing approaches do not always capture the fundamental properties of a key, namely identification and uniqueness, and it is shown that an XKey always has these properties. It is also shown that an XKey has the desirable property of extending the notion...
متن کاملIdentifying e-CRM Entities and Their Keys for Successful Implementation in the U.S. Healthcare Field
Online customer relationship management (e-CRM) has gained tremendous popularity in the business world recently. This paper presents a framework for classifying entities in the healthcare field. It also describes planned work related to the investigation of critical success factors for some of the entity types.
متن کاملUnlocking Keys for XML Trees
We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomatisation proposed for XML keys is incomplete even if key paths are simple. Therefore, the axiomatisation and also the implication problem for XML keys are still unsolved. We propose a set of inference rules that is indeed sound a...
متن کاملReasoning about Keys for XML
We study absolute and relative keys for XML, and investigate their associated decision problems. We argue that these keys are important to many forms of hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, these keys can be reasoned about efficiently. We show that the (finite) satisfiability problem for these keys is trivial, and their (finite)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Engineering and Technology Research
سال: 2017
ISSN: 2475-885X
DOI: 10.12783/dtetr/iceta2016/6977